Solving 3D block bidiagonal linear systems on vector computers

Solving linear systems on vector and shared memory computers

Change your habit to hang or waste the time to only chat with your friends. It is done by your everyday, don't you feel bored? Now, we will show you the new habit that, actually it's a very old habit to do that can make your life more qualified. When feeling bored of always chatting with your friends all free time, you can find the book enPDF solving linear systems on vector and shared memory c...

Low Rank Off-diagonal Block Preconditioners for Solving Sparse Linear Systems on Parallel Computers

For a sparse linear system Ax = b, preconditioners of the form C = D + L+ U , where D is the block diagonal part of A (or incomplete factorization approximation of its blocks), and L and U are block strictly lower and upper triangular matrices composed of low-ranks approximations of the respective blocks of A, are examined. C is applied directly, by solving Cz = w, or partially, by applying one...

Iteratively Solving Large Sparse Linear Systems on Parallel Computers

c © 2002 by John von Neumann Institute for Computing Permission to make digital or hard copies of portions of this work for personal or classroom use is granted provided that the copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise requires prior specific permission by the publisher ment...

Block Algorithms for FFTs on Vector and Parallel Computers

This work is part of a joint project of ANU and Fujitsu Ltd. Japan for the development of vector and parallel numerical algorithms and software. The results will be included in the Fujitsu Scientiic Subroutine Library. Coding and testing is done in cooperation with

On Solving Linear Diophantine Systems Using Generalized Rosser's Algorithm